package com.zhangxiaofanfan.hotcode.third;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.PriorityQueue;

/**
 * <a href="https://leetcode.cn/problems/top-k-frequent-elements/?envType=study-plan-v2&envId=top-100-liked">347. 前 K 个高频元素</a>
 *
 * @date 2024-07-13 03:14:13
 * @author zhangxiaofanfan
 */
public class HotCode075 {
    public static void main(String[] args) {
        HotCode075 hotCode = new HotCode075();
        int[] nums = {1,1,1,2,2,3};
        int k = 2;
        System.out.println(Arrays.toString(hotCode.topKFrequent(nums, k)));
    }

    public int[] topKFrequent(int[] nums, int k) {
        return null;
    }

    public static class Node {
        int num;
        int count;

        public Node(int num, int count) {
            this.num = num;
            this.count = count;
        }
    }
}
